A Parallel Maximal Matching Algorithm for Large Graphs Using Pregel
نویسندگان
چکیده
منابع مشابه
Relationship Queries on Large graphs using Pregel
Large-scale graph-structured data arising from social networks, databases, knowledge bases, web graphs, etc. is now available for analysis and mining. Graph-mining often involves “relationship queries”, which seek a ranked list of interesting interconnections among a given set of entities, corresponding to nodes in the graph. While relationship queries have been studied for many years, using va...
متن کاملA Simple Randomized Parallel Algorithm for Maximal f-Matching
We show how to extend the RNC-algorithm for maximal match-ings due to Israeli-Itai (presented in 5]) to compute maximal (with respect to set of edges inclusion) f-matchings. Our algorithm works in O(log 2 n) time on an arbitrary Crcw Pram with a linear number of processors. Also we slightly improve a constant coeecient in the analysis of the Israeli-Itai algorithm. Finally we present more eecie...
متن کاملA Fast and Simple Randomized Parallel Algorithm for Maximal Matching
Let G(V, E) be an undirected graph. A set M ~ E is a matching if no two edges of M have a common vertex. The matching M is maximal if it is not properly contained in any other matching. Note that this does not necessarily imply that M has more edges than any other matching. A maximal matching can be found sequentially by the following greedy algorithm: Start with an empty matching and add any e...
متن کاملfault location in power distribution networks using matching algorithm
چکیده رساله/پایان نامه : تاکنون روشهای متعددی در ارتباط با مکان یابی خطا در شبکه انتقال ارائه شده است. استفاده مستقیم از این روشها در شبکه توزیع به دلایلی همچون وجود انشعابهای متعدد، غیر یکنواختی فیدرها (خطوط کابلی، خطوط هوایی، سطح مقطع متفاوت انشعاب ها و تنه اصلی فیدر)، نامتعادلی (عدم جابجا شدگی خطوط، بارهای تکفاز و سه فاز)، ثابت نبودن بار و اندازه گیری مقادیر ولتاژ و جریان فقط در ابتدای...
An Improved Algorithm for Matching Large Graphs
In this paper an improved version of a graph matching algorithm is presented, which is able to efficiently solve the graph isomorphism and graph-subgraph isomorphism problems on Attributed Relational Graphs. This version is particularly suited to work with very large graphs, since its memory requirements are quite smaller than those of other algorithms of the same kind. After a detailed descrip...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2014
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.e97.d.1910